Global Graph Properties by Means ofLocal Computations : the Majority Problem 1
نویسنده
چکیده
This paper is a contribution to the study of the general problem of characterizing those properties which can be computed on a graph or a network by means of local transformations. By using an abstract model based on graph relabelling systems we consider the majority problem : let G be a graph whose vertices have label A or B ; we say that label A has the majority if the number of A-labelled vertices is strictly greater than the number of B-labelled vertices (jGj A > jGj B). We prove that there exists graph relabelling systems deciding for every connected graph G whether jGj A > jGj B (resp. jGj A = jGj B) or not. On the other hand, we prove that no such system can decide if jGj A > jGj B ? m (resp. jGj A = jGj B ? m), for any positive integer m.
منابع مشابه
Global Graph Properties byMeans of Local Computations : the Majority Problem
This paper is a contribution to the study of the general problem of characterizing those properties which can be computed on a graph or a network by means of local transformations. By using an abstract model based on graph relabelling systems we consider the majority problem : let G be a graph whose vertices have label A or B ; we say that label A has the majority if the number of A-labelled ve...
متن کاملAnalysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
متن کاملOn Reducing the Global State Graph for Verification of Distributed Computations
Correct distributed programs are very hard to write and reason about. Verification of distributed programs with respect to their specifications is thus very important to ensure that a distributed system works as expected. Model checking has emerged as a technique used to verify the correctness of programs. However model checking techniques suffer from the global state explosion problem finite s...
متن کاملAn Optimal Approach to Local and Global Text Coherence Evaluation Combining Entity-based, Graph-based and Entropy-based Approaches
Text coherence evaluation becomes a vital and lovely task in Natural Language Processing subfields, such as text summarization, question answering, text generation and machine translation. Existing methods like entity-based and graph-based models are engaging with nouns and noun phrases change role in sequential sentences within short part of a text. They even have limitations in global coheren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995